منابع مشابه
Well Behaved Transition Systems
The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem. We show coverability decidable for monotone transition systems that only require the absence of infinite antichains and call well behaved transitio...
متن کاملWell-behaved Production Economies
We show that production economies are tâtonnement stable if consumers satisfy the weak axiom of revealed preference. To ensure that producer supply decisions are well defined, we restrict prices in the tâtonnement so that positive profits cannot occur but do allow supply decisions to be multi-valued. The model therefore permits linear activities and hence the technologies that admit capital the...
متن کاملWell-Behaved IDL Theories
The eld of nonmonotonic logic, sixteen years old now, is devoted to solve the problem of reasoning under incomplete knowledge, whose good understanding is essential to the construction of AI as a science and whose relevance reaches far beyond AI applications. During these years, many insights have been accumulated in the form of desirable properties the proposed formalisms should exhibit and of...
متن کاملTowards Well-Behaved Schema Evolution
We study the problem of schema evolution in the RDF data model. RDF and the RDFS schema language are W3C standards for flexibly modeling and sharing data on the web. Although schema evolution has been intensively studied in the database and knowledge-representation communities, only recently has progress been made on the study of RDFS schema evolution. Indeed, the flexible nature of RDF poses n...
متن کاملThe Simplex Method is Not Always Well Behaved
This paper deals with the roundingerror analysis of the simplex method for solving linear-programming problems. We prove that in general any simplex-type algorithm is not well behaved, which means that the computed solution cannot be considered as an exact solution to a slightly perturbed problem. We also point out that simplex algorithms with well-behaved updating techniques (such as the Barte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Biochemistry
سال: 1992
ISSN: 0014-2956,1432-1033
DOI: 10.1111/j.1432-1033.1992.tb17005.x